Computational Complexity of Boolean Formulas with Query Symbols
نویسندگان
چکیده
03D15 (Mathematical logic and foundations / Recursion theory / Complexity of computation), 03E40 (Mathematical logic and foundations / Set theory / Other aspects of forcing and Boolean-valued models), 68Q15 (Computer science / Theory of computing / Complexity classes).
منابع مشابه
Span programs and quantum query algorithms
Quantum query complexity measures the number of input bits that must be read by a quantum algorithm in order to evaluate a function. Høyer et al. (2007) have generalized the adversary semidefinite program that lower-bounds quantum query complexity. By giving a matching quantum algorithm, we show that the general adversary lower bound is tight for every boolean function. The proof is based on sp...
متن کاملLeast span program witness size equals the general adversary lower bound on quantum query complexity
Span programs form a linear-algebraic model of computation, with span program “size” used in proving classical lower bounds. Quantum query complexity is a coherent generalization, for quantum algorithms, of classical decision-tree complexity. It is bounded below by a semi-definite program (SDP) known as the general adversary bound. We connect these classical and quantum models by proving that f...
متن کاملLower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of “simple” monotone functions under the uniform distribution. In this paper we give the first unconditional lower bounds for learning problems of this sort by showing that polynomial-time algorithms cannot learn constant-depth monotone Boolean formulas under the uniform distribution in the well-studied Statistical Query model. Using a recent ...
متن کاملFragments of Bounded Arithmetic and Bounded Query Classes Jan
We characterize functions and predicates Z^+, -definable in S!¡ ■ In particular, predicates I^+1-definable in S^ are precisely those in bounded query Y? YP class .Pi[0(logn)] (which equals to Log Space • by [B-H,W]). This implies yP that Sj ^ T-\ unless P •[0(lo$n)] = Apj+X . Further we construct oracle A such that for all i > 1 : P^iA)lO(logn)] ¿ tf¡+x(A). It follows that S fa) ¿ Tfa) for all ...
متن کاملEquivalence Models for Quantified Boolean Formulas
In this paper, the notion of equivalence models for quantified Boolean formulas with free variables is introduced. The computational complexity of the equivalence model checking problem is investigated in the general case and some restricted cases. We also establish a connection between the structure of some quantified Boolean formulas and the structure of models.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002